Integration of Ordered Constraint Hierarchies Based on a Non-Trivial Error Function in CLP(FD)
نویسنده
چکیده
In this paper, we propose ordered constraint hierarchies and a non-trivial error function to model and solve over-constrained real-world problems adequately. We present an algorithm to atten constraint hierarchies consisting of polynomial equations and in-equations. The algorithm is based on an incomplete nite domain constraint solver. We conclude with some implementation details, some examples, and some aspects about our future work.
منابع مشابه
Transforming Ordered Constraint Hierarchies into Ordinary Constraint Systems
In this paper, we propose ordered constraint hierarchies and a non-trivial error function to model and solve over-constrained real-world problems adequatly. We substantiate our proposition by an example. Then we present a new method to transform constraint hierarchies into equivalent ordinary constraint systems. For practial applications, we present a modiied algorithm based on an incomplete ni...
متن کاملSolving Hierarchies of Finite-domain Constraints 1 2
In the past we presented an algorithm to solve ordered constraint hierarchies based on a non-trivial error function using standard constraint satisfaction techniques. We extended this previous work and herewith present a new method to transform hierarchies of inequalities over the integers based on global comparators into equivalent ordered constraint hierarchies. The correctness of this method...
متن کاملEntailment of Finite Domain Constraints Entailment of Finite Domain Constraints
Using a glass-box theory of nite domain constraints, FD, we show how the entailment of user-deened constraints can be expressed by anti-monotone FD constraints. We also provide an algorithm for checking the entailment and consistency of FD constraints. FD is shown to be expressive enough to allow the deenition of arithmetical constraints, as well as non-trivial symbolic constraints, that are no...
متن کاملConstraint functional logic programming over finite domains
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP (FD) ) with a lazy functional logic programming language which seamlessly embodies finite domain (FD) constraints. This proposal increases the expressiveness and power of constraint logic programming over finite domains (CLP (FD) ) by combining functional and relational notation, curried ...
متن کاملCompiling Constraints in clp(FD)
We present the clp(FD) system: a Constraint Logic Programming language with finite domain constraints. We detail its implementation and present an abstract instruction set for the constraint solver that can be smoothly integrated into the WAM architecture. It is based on the use of a single primitive constraintX in r that embeds the core propagation mechanism. Complex user constraints such as l...
متن کامل